Static Routing in Stochastic Scheduling: Performance Guarantees and Asymptotic Optimality
نویسندگان
چکیده
We study the problem of scheduling a set of J jobs on M machines with stochastic job processing times when no preemptions are allowed and the weighted sum of expected completion time objective. Our model allows for “unrelated” machines: the distributions of processing times may vary across both jobs and machines. We study static routing policies, which assign (or “route”) each job to a particular machine at the start of the problem and then sequence jobs on each machine according to the WSEPT (weighted shortest expected processing time) rule. We discuss how to obtain a good routing of jobs to machines by solving a convex quadratic optimization problem that has J ×M variables and only depends on the job processing distributions through their expected values. Our main result is an additive performance bound on the sub-optimality of this static routing policy relative to an optimal adaptive, non-anticipative scheduling policy. This result implies that such static routing policies are asymptotically optimal as the number of jobs grows large. In the special case of “uniformly related” machines that is, machines differ only in their speeds we obtain a similar but slightly sharper result for a static routing policy that routes jobs to machines proportionally to machine speeds. We also study the impact that dependence in processing times across jobs can have on the sub-optimality of the static routing policy. The main novelty in our work is deriving lower bounds on the performance of an optimal adaptive, non-anticipative scheduling policy; we do this through the use of an information relaxation in which all processing times are revealed before scheduling jobs and a penalty that appropriately compensates for this additional information. Subject classifications: Stochastic scheduling, unrelated machines, dynamic programming, information relaxation duality, asymptotic optimality.
منابع مشابه
Static Routing in Stochastic Scheduling: Performance Guarantees and Asymptotic Optimality (Online Appendix)
متن کامل
Approximation Algorithms for Stochastic Optimization Problems in Operations Management
This article provides an introduction to approximation algorithms in stochastic optimization models arising in various application domains, including central areas of operations management, such as scheduling, facility location, vehicle routing problems, inventory and supply chain management and revenue management. Unfortunately, these models are very hard to solve to optimality both in theory ...
متن کاملApproximations to Stochastic Dynamic Programs via Information Relaxation Duality
In the analysis of complex stochastic dynamic programs (DPs), we often seek strong theoretical guarantees on the suboptimality of heuristic policies: a common technique for obtaining such guarantees is perfect information analysis. This approach provides bounds on the performance of an optimal policy by considering a decision maker who has access to the outcomes of all future uncertainties befo...
متن کاملOptimal Control of Stochastic Networks - an Approach via Fluid Models
We consider a general control problem for networks which includes the special cases of scheduling in multiclass queueing networks and routing problems. The fluid approximation of the network is used to derive new results about the optimal control for the stochastic network. The main emphasis lies on the average cost criterion, however the β-discounted as well as the finite cost problem are also...
متن کاملA multi-product vehicle routing scheduling model with time window constraints for cross docking system under uncertainty: A fuzzy possibilistic-stochastic programming
Mathematical modeling of supply chain operations has proven to be one of the most complex tasks in the field of operations management and operations research. Despite the abundance of several modeling proposals in the literature; for vast majority of them, no effective universal application is conceived. This issue renders the proposed mathematical models inapplicable due largely to the fact th...
متن کامل